Algorithmic Self-Assembly of Circuits

نویسندگان

  • Michael deLorimier
  • Alexandre Mathy
  • Dustin Reishus
  • Rolfe Schmidt
  • Bilal Shaw
  • Li Chin Wong
چکیده

The order we see in nature is self-assembled: atoms, crystals, cells, animals, solar systems, and galaxies are just a few examples. While we have been able to build phenomenal devices with controlled assembly techniques, we still cannot engineer machines at the scale of the ribosome. Can we understand the mechanism behind natural self-assembly and harness it to fabricate new devices? A systematic attack on this problem as been initiated [5, 1], and in this paper we use these techniques to explore how self-assembly could be used to fabricate nanoscale electrical circuits. We start with a simple model, where molecules are thought of as two dimensional square tiles [Wang] having different glue types on north, east, south and west sides. These glues have strengths associated with them which will be important later on. Now tiles that have matching glues stick to each other. The model that we have considered is an irreversible one, which means that once tiles stick together with a certain bond strength they do not come apart. In reality, molecular bonds are reversible. But some bonds are stronger than others, and if a molecule is attached in more than one place it is less likely to fall off. Analysis of the thermodynamics of these interactions shows that for some temperatures our model that “tiles with matching glues stick” is actually fairly accurate [7]. This is called the T = 1 model: the temperature T is such that only one matching bond is needed for two tiles to stick to each other. The behavior is different at other temperatures. As the temperature rises above T = 1, eventually it reaches a point where in equilibrium, a tile sticks to other tiles only if it can find two bonds (or one double strength bond). This gives us a new model of self assembly which seems more powerful than the first. Not surprisingly, it is called the T = 2 model.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nano Architectures for Carbon Nanotube Circuits: Design, Analysis, and Experimental Attempts Extended Abstract

Recent years have witnessed a burst of experimental activity concerning algorithmic self-assembly of nanostructures, motivated at least in part by the potential of this approach as a radically new manufacturing technology. Our specific interest is in the self-assembly of Carbon-Nanotube Field Effect Transistor (CNFET) circuits. Our research is focused on developing a new theoretical foundation ...

متن کامل

Self-Assembled Circuit Patterns

Self-assembly is a process in which basic units aggregate under attractive forces to form larger compound structures. Recent theoretical work has shown that pseudo-crystalline self-assembly can be algorithmic, in the sense that complex logic can be programmed into the growth process [26]. This theoretical work builds on the theory of twodimensional tilings [8], using rigid square tiles called W...

متن کامل

Capabilities and Limits of Compact Error Resilience Methods for Algorithmic Self-assembly in Two and Three Dimensions

Winfree’s pioneering work led the foundations in the area of errorreduction in algorithmic self-assembly[26], but the construction resulted in increase of the size of assembly. Reif et. al. contributed further in this area with compact error-resilient schemes [15] that maintained the original size of the assemblies, but required certain restrictions on the Boolean functions to be used in the al...

متن کامل

Algorithmic DNA Self-assembly

Self-assembly is a process by which simple objects autonomously assemble into complexes. This phenomenon is common in nature but is not yet well understood from mathematical and programming perspectives. It is believed that self-assembly technology will ultimately permit the precise fabrication of complex nanostructures. There are many kinds of self-assembly and DNA self-assembly is of particul...

متن کامل

Programmable Control of Nucleation for Algorithmic Self-assembly

Algorithmic self-assembly, a generalization of crystal growth processes, has been proposed as a mechanism for autonomous DNA computation and for bottom-up fabrication of complex nanostructures. A ‘program’ for growing a desired structure consists of a set of molecular ‘tiles’ designed to have specific binding interactions. A key challenge to making algorithmic self-assembly practical is designi...

متن کامل

Contributions to computational phylogenetics and algorithmic self-assembly

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ix CHAPTER 1. General Introduction . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.1 Computational Phylogenetics . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.1.1 The Perfect Phylogeny Problem . . . . . . . . . . . . . . . . . . . . . . . 2 1.1.2 The Tree Compatibility Problem . . . . . . . . . . ....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002